1413B - A New Technique - CodeForces Solution

#include <bits/stdc++.h>
#include <iostream>
#define ll long long
using namespace std;

int main()
{
    ll t;
    cin >> t;
    while (t--)
    {
        ll n, m;
        cin >> n >> m;
        int row[n][m] = {0};
        int col[m][n] = {0};
        int mat[n][m] = {0};
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cin >> row[i][j];
            }
        }
        for (int i = 0; i < m; i++)
        {
            for (int j = 0; j < n; j++)
            {
                cin >> col[i][j];
            }
        }
        for (int i = 0; i < m; i++)
        {
            // set<int> s;
           // map<int, int> ma;
            // for (int j = 0; j < n; j++)
            // {
            //     ma[row[j][i]]++;
            // }
            int first=row[0][i];
            int ind = -1;
            for (int k = 0; k < m; k++)
            {
                ind =k;
                int flag=0;
                //map<int, int> ma1;
                for (int i = 0; i < n; i++)
                {
                    //ma1[col[k][i]]++;
                    if(col[k][i]==first)
                    {
                        //ind=k;
                        flag=1;
                        break;
                    }
                }
                if(flag==1)
                {
                    //flag=0;
                    break;
                }
                
               
            }
            for (int y = 0; y < n; y++)
            {
                mat[y][i] = col[ind][y];
            }
        }
        for (int i = 0; i < n; i++)
        {
            for (int j = 0; j < m; j++)
            {
                cout << mat[i][j] << " ";
            }
            cout << endl;
        }
    }

    return 0;
}